On Learning width Two Branching Programs

نویسندگان

Nader H. Bshouty

Christino Tamon

David K. Wilson

چکیده

We prove that strict width two branching programs or SW2 (which are width two branching programs with exactly two sinks, as defined in [BDFP86]) are properly PAC learnable under any distribution. We also observe that PAC learning monotone width two branching programs (which are width two branching programs with exactly one rejecting sink) is as hard as learning DNF formulae. This work refines both the positive and negative results in [ERR95] and answers one of the open questions in that paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Learning Branching Programs and Small Depth Circuits

This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some of the results extend earlier works in GG95, ERR95, BTW95]. The main results are as follows. For branching programs we show the following. 1. Any monotone width two branching program (deened by Bor...

متن کامل

Subquadratic Simulations of Balanced Formulae by Branching Programs

This paper considers Boolean formulae and their simulations by bounded width branching programs. It is shown that every balanced Boolean formula of size s can be simulated by a constant width (width 5) branching program of length s 1.81 l.... A lower bound for the translational cost from formulae to permutation branching programs is also presented. Key words, branching programs, Boolean formula...

متن کامل

Counting paths in planar width 2 branching programs

We revisit the problem of counting paths in width-2 planar branching programs. We show that this is hard for Boolean NC under ACC[5] reductions, completing a proof strategy outlined in [3]. On the other hand, for several restricted instances of width-2 planar branching programs, we show that the counting problem is TC-complete. We also show that nonplanar width-2 programs can be planarized in A...

متن کامل

Classical Simulation Complexity of Quantum Branching Programs (Draft)

We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that computes the same function. Second technique is a classical stochastic simulation technique f...

متن کامل